Fast General Sorting on Meshes of Arbitrary Dimension Without Routing
نویسنده
چکیده
In this paper, we present a parallel sorting algorithm for meshes of arbitrary dimension that generalizes two known algorithms for sorting on the two-dimensional mesh and on the hypercube, respectively. It uses a speciic indexing scheme, called generalized snake-like numbering. The algorithm has a running time of O(d 2 m log m) on the d-dimensional mesh with side length m. The advantages of the algorithm are its simplicity and its dispensing with any routing.
منابع مشابه
Permutation Routing and Sorting on Meshes with Row and Column Buses
We study the problems of permutation routing and sorting on several models of meshes with xed and reconngurable row and column buses. We describe two fast and fairly simple deterministic algorithms for permutation routing on two-dimensional networks, and a more complicated algorithm for multi-dimensional networks. The algorithms are obtained by converting two known oo-line routing schemes into ...
متن کاملOptimal Average Case Sorting on Arrays
We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We improve this to a load of eight without increasing the running time. For tori no optimal algorithms were...
متن کاملRouting and Sorting on Meshes with Row and Column Buses
We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...
متن کاملEfficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length
Sorting and balanced routing problems for synchronous mesh-like processor networks with reconfigurable buses are considered. Induced by the argument that broadcasting along buses of arbitrary length withinunit time seems rather non-realistic, we consider basic problems on reconfigurable meshes that can be solved efficiently even with restricted bus length. It is shown that on r-dimensional reco...
متن کاملFast Token Distribution on Recon gurable Meshes
The token distribution problem is an important data distribution problem akin to the problems of sorting and routing, in which data elements, or tokens-must be evenly distributed amongst the processors of a parallel network. To date, all algorithms to solve this problem on the mesh and reconngurable mesh architectures have lagged (in terms of the time required to obtain a solution) the state-of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991